Ball tree

A ball tree is a data structure designed to enable fast nearest neighbor searching in high-dimensional spaces, by covering the points in a dataset with a system of balls arranged in a tree.

See also

• M-tree
• Bounding volume hierarchy

Further reading

• Witten, Ian H.; Frank, Eibe; Hall, Mark A. (2011), Data Mining: Practical Machine Learning Tools and Techniques (3rd ed.), Elsevier, pp. 134–136, ISBN 978-0-12-374856-0 

External links

• PDF paper Stephen M. Omohundro, "Five Balltree Construction Algorithms", November 1989.